Query-Level Ranker Specialization
نویسندگان
چکیده
Traditional Learning to Rank models optimize a single ranking function for all available queries. is assumes that all queries come from a homogenous source. Instead, it seems reasonable to assume that queries originate from heterogenous sources, where certain queries may require documents to be ranked dierently. We introduce the Specialized Ranker Model which assigns queries to dierent rankers that become specialized on a subset of the available queries. We provide a theoretical foundation for this model starting from the listwise Placke-Luce ranking model and derive a computationally feasible expectation-maximization procedure to infer the model’s parameters. Furthermore we experiment using a noisy oracle to model the risk/reward tradeo that exists when deciding which specialized ranker to use for unseen queries. ACM Reference format: Rolf Jagerman, Harrie Oosterhuis, and Maarten de Rijke. 2017. erylevel Ranker Specialization. In Proceedings of the first International Workshop on LEARning Next gEneration Rankers, Amsterdam, October 1, 2017 (LEARNER 2017), 5 pages.
منابع مشابه
ery-level Ranker Specialization
Traditional Learning to Rank models optimize a single ranking function for all available queries. is assumes that all queries come from a homogenous source. Instead, it seems reasonable to assume that queries originate from heterogenous sources, where certain queries may require documents to be ranked dierently. We introduce the Specialized Ranker Model which assigns queries to dierent ranke...
متن کاملA Discriminative Model for Query Spelling Correction with Latent Structural SVM
Discriminative training in query spelling correction is difficult due to the complex internal structures of the data. Recent work on query spelling correction suggests a two stage approach a noisy channel model that is used to retrieve a number of candidate corrections, followed by discriminatively trained ranker applied to these candidates. The ranker, however, suffers from the fact the low re...
متن کاملCost-Effective Combination of Multiple Rankers: Learning When Not To Query
Combining multiple rankers has potential for improving the performance over using any of the single rankers. However, querying multiple rankers for every search request can often be too costly due to efficiency or commercial reasons. In this work, we propose a more cost-effective approach that predicts the utility of any additional rankers, prior to querying them. We develop a combined measure ...
متن کاملA Large Scale Ranker-Based System for Search Query Spelling Correction
This paper makes three significant extensions to a noisy channel speller designed for standard written text to target the challenging domain of search queries. First, the noisy channel model is subsumed by a more general ranker, which allows a variety of features to be easily incorporated. Second, a distributed infrastructure is proposed for training and applying Web scale n-gram language model...
متن کاملA Co-Ranking Algorithm for Learning Listwise Ranking Functions from Unlabeled Data
In this paper, we propose a co-ranking algorithm that trains listwise ranking functions using unlabeled data simultaneously with a small number of labeled data. The coranking algorithm is based on the co-training paradigm that is a very common scheme in the semi-supervised classification framework. First, we use two listwise ranking methods to construct base ranker and assistant ranker, respect...
متن کامل